Bayesian Optimization Allowing for Common Random Numbers
نویسندگان
چکیده
More Efficient Bayesian Optimization Through the Use of Common Random Numbers optimization is a powerful tool for expensive stochastic black-box problems, such as simulation-based or hyperparameter tuning in machine learning systems. In “Bayesian Allowing Numbers,” Pearce, Poloczek, and Branke show how explicitly modeling random seed Gaussian process surrogate model allows to exploit structure noise benefit from variance reduction provided by common numbers. The proposed knowledge gradient with numbers acquisition function iteratively determines combination input evaluate objective. It automatically trades off reusing old seeds through querying new avoid bias because small number seeds. algorithm analyzed theoretically empirically shows superior performance compared previous approaches on various test problems.
منابع مشابه
Laws of Large Numbers for Random Linear
The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...
متن کاملON THE LAWS OF LARGE NUMBERS FOR DEPENDENT RANDOM VARIABLES
In this paper, we extend and generalize some recent results on the strong laws of large numbers (SLLN) for pairwise independent random variables [3]. No assumption is made concerning the existence of independence among the random variables (henceforth r.v.’s). Also Chandra’s result on Cesàro uniformly integrable r.v.’s is extended.
متن کاملTesting unrolling optimization technique for quasi random numbers
Quasi Monte Carlo simulations are built on quasi random number generator (QRNG). Even if the use of a QRNG might lead to a faster convergence, for example with Monte Carlo integral computation, most of the simulation time can be taken by the number generation part. This paper present an optimization technique, called “unrolling” applied to QRNG. It consists in the generation and storage of rand...
متن کاملBayesian Optimization in a Billion Dimensions Bayesian Optimization in a Billion Dimensions via Random Embeddings
Bayesian optimization techniques have been successfully applied to robotics, planning, sensor placement, recommendation, advertising, intelligent user interfaces and automatic algorithm configuration. Despite these successes, the approach is restricted to problems of moderate dimension, and several workshops on Bayesian optimization have identified its scaling to high-dimensions as one of the h...
متن کاملWiener numbers of random pentagonal chains
The Wiener index is the sum of distances between all pairs of vertices in a connected graph. In this paper, explicit expressions for the expected value of the Wiener index of three types of random pentagonal chains (cf. Figure 1) are obtained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2022
ISSN: ['1526-5463', '0030-364X']
DOI: https://doi.org/10.1287/opre.2021.2208